integr biomark discoveri breast cancer metastasi gene express protein interact data error dtoler pattern mine compar studi algorithm land cover chang knowledg discoveri strategi relat sea surfac temperatur frequenc tropic storm gener predict hurrican st dcenturi global warm scenario discoveri pattern global earth scienc data data mine subspac differenti coexpress analysi problem definit gener approach associ analysi techniqu bioinformat problem abstract associ analysi popular analysi paradigm data mine solid foundat associ analysi potenti applic group techniqu wide classif cluster domain bioinformat comput biologi paper present type associ pattern discuss applic bioinformat present case studi show us associ analysi base techniqu pre process protein interact network task protein function predict final discuss challeng address make associ analysi base techniqu applic number interest problem bioinformat uml model eae regulatori network associ analysi approach biclust discoveri biclust denot group item show coher valu subset transact data set import type analysi perform real valu data set domain biologi algorithm propos find type biclust data set algorithm unabl search space biclust exhaust pattern mine algorithm associ analysi essenti produc biclust result pattern consist item support subset transact major limit numer techniqu develop associ analysi analyz data set binari categor variabl applic real valu data set involv lossi transform discret binar attribut framework explor categor data load balanc parallel optim techniqu incorpor function inter drelationship protein function predict algorithm character pattern preserv cluster systemat evalu scale method gene express data experiment prepar gene express data set pre process account variat microarrai technolog inconsist scale measur condit happen reason accumul gene express data prepar laboratori singl data set varieti scale transform method address scale inconsist studi analysi gene express data set quantit estim rel perform lack paper report extens evalu scale transform method effect respect import problem protein function predict commonli method gene express data score scale quantil normal diff transform scale method sigmoid doubl sigmoid previous domain knowledg show perform method vari significantli data set dsigmoid scale score transform gener perform type gene express data tempor tempor compar evalu anomali detect techniqu sequenc data anomali detect tradition dealt record transact type data set real domain data natur occur sequenc desir studi anomali detect techniqu sequenti data set problem detect anomali sequenc data set relat tradit anomali detect problem natur data anomali found record data set survei compar evalu tradit anomali detect similar studi sequenc anomali detect investig broad spectrum anomali detect techniqu symbol sequenc propos divers applic domain hypothesi symbol sequenc domain distinct characterist term natur sequenc natur anomali make import investig techniqu behav type sequenc data studi critic understand rel strength weak techniqu paper attempt compar evalu anomali detect techniqu public data set collect divers applic domain gain understand perform techniqu present gener sequenc data desir characterist result artifici gener data set experiment verifi hypothesi techniqu quantit evalu approxim frequent pattern mine algorithm semi dsupervis approach rapid reliabl label larg data set semi dsupervis approach rapid reliabl label larg data set land cover chang detect case studi studi land cover chang import problem earth scienc domain impact local climat radiat balanc biogeochemistri hydrolog divers abund terrestri speci chang detect techniqu statist signal process control theori suit massiv high dimension spatio tempor data set earth scienc due limit high comput complex inabl advantag season spatio tempor autocorrel inher earth scienc data work seek address challeng chang detect techniqu base data mine approach specif paper perform case studi chang detect techniqu land cover chang detect problem studi land cover chang state california focus san francisco bai area perform extend studi entir state perform compar evalu forest entir state result demonstr util data mine techniqu land cover chang detect problem similar measur categor data compar evalu measur similar distanc entiti kei step data mine knowledg discoveri task notion similar continu data understood categor data similar comput straightforward data driven similar measur propos literatur comput similar categor data instanc rel perform evalu paper studi perform varieti similar measur context specif data mine task outlier detect result varieti data set show measur domin type problem measur consist high perform robust effici identif biomark classifi featur graph top algorithm data mine abstract paper present top data mine algorithm identifi ieee intern confer data mine icdm decemb mean svm apriori em pagerank adaboost knn naiv bay cart top algorithm influenti data mine algorithm research commun algorithm provid descript algorithm discuss impact algorithm review current research algorithm algorithm cover classif summari report sdm panel perspect research direct trend data mine research commun data analysi st centuri summari report sdm panel perspect research direct trend data mine research commun high perform data mine applic discoveri pattern global climat system ddda fitr data mine explor middlewar grid distribut comput associ analysi dbase transform protein interact network function predict case studi protein interact network promis type biolog data discoveri function modul predict individu protein function network incomplet inaccur spuriou edg lack biolog valid edg handl problem transform origin interact graph graph remov spuriou edg add biolog valid assign reliabl score edg constitut final network investig exist method propos robust associ analysi base method task method base concept confid measur extract group object high similar experiment evalu protein interact data set show hypercliqu base transform enhanc perform standard function predict algorithm significantli merit categori subject descriptor estim fals neg classif problem cluster structur estim number fals neg classifi true outcom classif ascertain limit number instanc import problem wide rang applic epidemiolog comput network secur frequent appli method random sampl target posit class classif rare case network intrus diseas simpl method result excess sampl paper propos approach exploit cluster structur data significantli reduc amount sampl need guarante estim accuraci user basic idea cluster data divid cluster set strata proport posit instanc stratum low high take advantag characterist strata effici estim strategi appli significantli reduc amount requir sampl develop computation effici cluster algorithm refer class focus partit imperfect label predict classifi addit guidanc evalu method kddcup network intrus data set method achiev precis accuraci sampl trial simpl random sampl sampl gener notion confid abstract social aspect secur inform system discuss term actual secur perceiv secur lead hypothesi vote controversi paper vote actual perceiv secur coincid electron system paper argu distinct actual perceiv secur problemat philosoph perspect develop altern approach base notion trust investig mean notion comput scienc link philosoph work luhmann distinguish familiar confid trust analysi yield distinct discuss trust relat respect inform technolog appli framework electron vote propos hypothes possibl explain smooth introduct electron vote machin netherland earli nineti summar compress data inform represent paper formul problem summar dataset transact categor attribut optim problem involv object function compact gain inform loss propos metric character output summar algorithm investig approach address problem approach adapt cluster approach make frequent itemset associ analysi domain illustr applic summar field network data show techniqu effect summar network traffic compact meaning represent specif evalu propos algorithm darpa line intrus detect evalu data network data gener skaion corp arda inform assur program comput scienc applic iccsa comput scienc applic iccsa comput scienc applic iccsa comput scienc applic iccsa comput scienc applic iccsa privaci preserv nearest neighbor search divid conquer approach effici pagerank comput scan detect data mine approach precursor attack network reconnaiss oper commonli refer scan vast amount attent focus method scan detect state ofth art method suffer high rate fals alarm low rate scan detect paper formal problem scan detect data mine problem show network traffic data set convert data set run shelf classifi method successfulli demonstr data mine model encapsul expert knowledg creat adapt algorithm substanti outperform state ofth art method scan detect coverag precis hypercliqu pattern discoveri abstract exist algorithm mine associ pattern reli support base prune strategi prune combinatori search space strategi effect discov potenti interest pattern low level support gener spuriou pattern involv item support level poorli correl paper present framework mine highli correl associ pattern call hypercliqu pattern framework object measur call confid appli discov hypercliqu pattern prove object hypercliqu pattern guarante level global pairwis similar measur cosin similar uncent pearson correl coeffici show confid measur satisfi cross support properti effici elimin spuriou pattern involv item substanti support level cross support properti limit hconfid gener associ measur addit algorithm call hypercliqu miner propos exploit cross support anti monoton properti confid measur effici discoveri hypercliqu pattern final experiment result show hypercliqu miner effici identifi hypercliqu pattern extrem low level support keyword associ analysi hypercliqu pattern confid enhanc data analysi nois remov remov object nois import goal data clean nois hinder type data analysi exist data clean method focu remov nois result low level data error result imperfect data collect process data object irrelev weakli relev significantli hinder data analysi goal enhanc data analysi object consid nois respect underli analysi data clean techniqu remov type nois data set larg amount nois techniqu discard potenti larg fraction data paper explor techniqu intend nois remov enhanc data analysi presenc high nois level taper dstep approach dstrong dpair correl queri larg databas abstract user minimum correl threshold market basket databas item transact strong pair correl queri find item pair correl threshold number item transact larg comput cost queri high goal paper provid computation effici algorithm answer strong pair correl queri identifi upper bound pearson correl coeffici binari variabl upper bound cheaper comput pearson correl coeffici exhibit special monoton properti prune item pair comput upper bound step allstrong pair corel queri taper algorithm propos exploit properti filter refin manner provid algebra cost model show comput save prune independ improv number item increas data set zipf linear rank support distribut experiment result synthet real world data set exhibit similar trend show taper algorithm order magnitud faster brute forc altern final demonstr algorithm idea develop taper algorithm extend effici comput neg correl uncent pearson correl coeffici index term associ analysi data mine pearson correl coeffici statist comput taper dstep approach dstrong dpair correl queri larg databas abstract user minimum correl threshold market basket databas item transact strong pair correl queri find item pair correl threshold number item transact larg comput cost queri high goal paper provid computation effici algorithm answer strong pair correl queri identifi upper bound pearson correl coeffici binari variabl upper bound cheaper comput pearson correl coeffici exhibit special monoton properti prune item pair comput upper bound step allstrong pair corel queri taper algorithm propos exploit properti filter refin manner provid algebra cost model show comput save prune independ improv number item increas data set zipf linear rank support distribut experiment result synthet real world data set exhibit similar trend show taper algorithm order magnitud faster brute forc altern final demonstr algorithm idea develop taper algorithm extend effici comput neg correl uncent pearson correl coeffici index term associ analysi data mine pearson correl coeffici statist comput privaci leakag multi drelat databas semi dsupervis learn perspect multi relat databas view context content depend subset tabl view preserv privaci hide sensit inform recent develop data mine present challeng databas secur tradit databas secur techniqu databas access control emploi paper present data mine framework semi supervis learn demonstr potenti privaci leakag multi relat databas type semi supervis learn techniqu nearest neighbor knn method demonstr privaci leakag introduc approach semi supervis learn hypercliqu pattern base semi supervis learn hpsl differ tradit semi supervis learn approach consid similar group object pair object experiment result show knn hpsl method abil compromis databas secur hpsl privaci violat higher predict accuraci knn method final provid principl avoid privaci leakag multi relat databas semi supervis learn illustr principl simpl prevent techniqu effect demonstr experi introduct data mine introduct data mine ag refer inform ag inform ag inform lead power success sophist technolog comput satellit collect tremend amount inform initi advent comput mean mass digit storag start collect store sort data count power comput sort amalgam inform massiv collect data store dispar structur rapidli overwhelm initi chao led creation structur databas databas manag system dbm effici databas manag system import asset manag larg corpu data effect effici retriev inform larg collect need prol comput scienc applic iccsa comput scienc applic iccsa comput scienc applic iccsa comput scienc applic iccsa gener notion confid abstract social aspect secur inform system discuss term actual secur perceiv secur lead hypothesi vote controversi paper vote actual perceiv secur coincid electron system paper argu distinct actual perceiv secur problemat philosoph perspect develop altern approach base notion trust investig mean notion comput scienc link philosoph work luhmann distinguish familiar confid trust analysi yield distinct discuss trust relat respect inform technolog appli framework electron vote propos hypothes possibl explain smooth introduct electron vote machin netherland earli nineti summar compress data inform represent paper formul problem summar dataset transact categor attribut optim problem involv object function compact gain inform loss propos metric character output summar algorithm investig approach address problem approach adapt cluster approach make frequent itemset associ analysi domain illustr applic summar field network data show techniqu effect summar network traffic compact meaning represent specif evalu propos algorithm darpa line intrus detect evalu data network data gener skaion corp arda inform assur program featur bag outlier detect outlier detect recent import problem industri financi applic paper featur bag approach detect outlier larg high dimension noisi databas propos combin result multipl outlier detect algorithm appli set featur outlier detect algorithm small subset featur randomli select origin featur set result outlier detector identifi outlier assign data record outlier score correspond probabl outlier outlier score comput individu outlier detect algorithm combin order find qualiti outlier experi perform synthet real life data set show propos method combin output multipl outlier detect algorithm provid trivial improv base algorithm identif function modul protein complex hypercliqu pattern discoveri increment page rank comput evolv graph link analysi popular wide web mine techniqu area web search rank scheme base link analysi propos pagerank metric gain popular success googl year signific work improv relev model pagerank address issu person topic relev addit varieti idea propos address comput aspect pagerank term effici comput matrix comput involv comput pagerank score kei challeng perform comput larg web graph paper propos method increment comput pagerank larg graph evolv note web graph evolv time rate chang slow compar size exploit underli principl order markov model pagerank base increment comput pagerank evolv web graph experiment result show signific speed comput cost comput involv small portion web graph undergon chang approach gener increment comput evolv graph metric satisfi order markov properti parallel distribut comput cybersecur idr fqr increment dimens reduct algorithm qr decomposit dimens reduct critic databas data mine applic cient storag retriev high dimension data literatur dimens reduct scheme linear discrimin analysi lda common aspect previous propos lda base algorithm singular decomposit svd due di culti design increment solut eigenvalu problem product scatter matric lda work design increment lda algorithm paper propos lda base increment dimens reduct algorithm call idr qr appli qr decomposit svd unlik lda base algorithm algorithm requir data matrix main memori desir larg data set importantli insert data item idr qr algorithm constrain comput cost appli cient qr updat techniqu final evalu ectiv idr qr algorithm term classif accuraci reduc dimension space experi real world data set reveal accuraci achiev idr qr algorithm close accuraci achiev lda base algorithm idr qr algorithm comput cost data item dynam insert comput scienc applic iccsa import proof assur protocol implement secur properti kei establish protocol protocol design fail provid proof secur flaw detect long public implement protocol erod credibl kei establish protocol revisit recent work choo boyd hitchcock maitland util bellar pointchev rogawai authent kei exchang secur dictionari attack preneel ed advanc cryptolog eurocrypt springer verlag lnc pp comput complex proof model machin specif analysi autom model checker shvt provabl secur kei establish protocol analysi examin kei establish protocol proof secur protocol due jan chen comput scienc applic iccsa import proof assur protocol implement secur properti kei establish protocol protocol design fail provid proof secur flaw detect long public implement protocol erod credibl kei establish protocol revisit recent work choo boyd hitchcock maitland util bellar pointchev rogawai authent kei exchang secur dictionari attack preneel ed advanc cryptolog eurocrypt springer verlag lnc pp comput complex proof model machin specif analysi autom model checker shvt provabl secur kei establish protocol analysi examin kei establish protocol proof secur protocol due jan chen comput scienc applic iccsa import proof assur protocol implement secur properti kei establish protocol protocol design fail provid proof secur flaw detect long public implement protocol erod credibl kei establish protocol revisit recent work choo boyd hitchcock maitland util bellar pointchev rogawai authent kei exchang secur dictionari attack preneel ed advanc cryptolog eurocrypt springer verlag lnc pp comput complex proof model machin specif analysi autom model checker shvt provabl secur kei establish protocol analysi examin kei establish protocol proof secur protocol due jan chen comput scienc applic iccsa import proof assur protocol implement secur properti kei establish protocol protocol design fail provid proof secur flaw detect long public implement protocol erod credibl kei establish protocol revisit recent work choo boyd hitchcock maitland util bellar pointchev rogawai authent kei exchang secur dictionari attack preneel ed advanc cryptolog eurocrypt springer verlag lnc pp comput complex proof model machin specif analysi autom model checker shvt provabl secur kei establish protocol analysi examin kei establish protocol proof secur protocol due jan chen support envelop techniqu explor structur associ pattern paper introduc support envelop tool analyz associ pattern illustr properti applic extens specif support envelop transact data set pair posit integ consist item transact search find associ pattern involv transact item transact data set transact item uniqu lattic support envelop captur structur associ pattern data set support envelop encumb support threshold support lattic complet view associ structur data set includ associ pattern low support boundari support lattic support boundari min envelop interest bound maximum size potenti associ pattern frequent close maxim itemset pattern error toler itemset gener associ structur repres graphic dimension scatter plot valu support envelop data set featur exploratori analysi associ pattern final algorithm comput support envelop simpl computation effici straightforward parallel process find support envelop exploit support dbase upper bound pearson correl coeffici effici identifi strongli correl pair user minimum correl threshold market basket databas item transact strong pair correl queri find item pair correl threshold number item transact larg comput cost queri high paper identifi upper bound pearson correl coe cient binari variabl upper bound cheaper comput pearson correl coe cient exhibit special monoton properti prune item pair comput upper bound step strong pair correl queri taper algorithm propos exploit properti filter refin manner provid algebra cost model show comput save prune independ improv number item increas data set common zipf linear rank support distribut experiment result synthet real data set exhibit similar trend show taper algorithm order magnitud faster brute forc altern idr fqr increment dimens reduct algorithm qr decomposit dimens reduct critic databas data mine applic cient storag retriev high dimension data literatur dimens reduct scheme linear discrimin analysi lda common aspect previous propos lda base algorithm singular decomposit svd due di culti design increment solut eigenvalu problem product scatter matric lda work design increment lda algorithm paper propos lda base increment dimens reduct algorithm call idr qr appli qr decomposit svd unlik lda base algorithm algorithm requir data matrix main memori desir larg data set importantli insert data item idr qr algorithm constrain comput cost appli cient qr updat techniqu final evalu ectiv idr qr algorithm term classif accuraci reduc dimension space experi real world data set reveal accuraci achiev idr qr algorithm close accuraci achiev lda base algorithm idr qr algorithm comput cost data item dynam insert gener notion support goal paper show gener notion support extend associ analysi tradit type pattern binari data end describ framework gener support base simpl observ support view composit function function evalu strength presenc pattern object transact function summar evalu singl number kei goal framework peopl easili express explor commun idea illustr support framework describ support varieti commonli associ pattern frequent itemset gener boolean pattern error toler itemset present exampl practic us gener support show us support function continu data show hypercliqu pattern associ pattern origin defin binari data extend continu data gener support function framework discov dlocat pattern data set extend spatial object credo classif rippl structur case rare class hicap hierarch cluster pattern preserv rba integr framework regress base associ rule select object measur associ analysi comput scienc applic iccsa comput scienc applic iccsa comput scienc applic iccsa optim dmeasur support vector machin optim dmeasur support vector machin local predict continu target variabl hierarch cluster paper propos techniqu effici predict multipl continu target variabl high dimension heterogen data set hierarch cluster approach propos approach consist phase appli recurs partit local predict partit step similar target variabl group cluster algorithm local step classif model predict group target variabl interest identifi group target variabl larg number target variabl partit local step repeat recurs identifi group split subgroup similar target variabl number target variabl identifi subgroup suffici small step predict target variabl local predict model built data record correspond subgroup experi perform problem damag predict complex mechan structur propos hierarch approach computation effici accur straightforward method predict target variabl individu simultan global predict model mine strong affin associ pattern data set skew support distribut exist associ rule mine algorithm reli support base prune strategi prune combinatori search space strategi effect data set skew support distribut tend gener spuriou pattern involv item support level miss potenti interest low support pattern overcom problem propos concept hypercliqu pattern object measur call confid identifi strong affin pattern introduc concept crosssupport properti elimin pattern involv item substanti support level experiment result demonstr effect method find pattern dens data set low support threshold exist algorithm break final hypercliqu pattern show great promis cluster item high dimension space discoveri climat indic cluster analyz effect ocean atmospher land climat earth scientist develop climat indic time seri summar behavior select region earth ocean atmospher past earth scientist observ recent eigenvalu analysi techniqu princip compon analysi pca singular decomposit svd discov climat indic eigenvalu techniqu find strongest signal impos condit discov signal orthogon make difficult attach physic interpret paper present altern cluster base methodolog discoveri climat indic overcom limit base cluster repres region homogen behavior centroid cluster time seri summar behavior ocean atmospher region centroid correspond climat indic provid valid methodolog centroid variant indic provid predict power land area indic repres potenti earth scienc phenomena final show cluster base indic gener outperform svd deriv indic term area weight correl direct correl indic correl analysi spatial time seri dataset filter dand drefin approach spatial time seri dataset collect time seri referenc locat common spatial framework correl analysi identifi pair interact element cross product spatial time seri dataset comput cost correl analysi high dimens time seri number locat spatial framework larg kei contribut paper spatial autocorrel spatial neighbor time seri reduc comput cost filter refin algorithm base cone group locat propos reduc cost correl analysi pair spatial time seri dataset cone level correl comput elimin filter larg number element pair correl threshold cluster algorithm transact data caucu compar studi anomali detect scheme network intrus detect abstract intrus detect correspond suit techniqu identifi attack comput network infrastructur anomali detect kei element intrus detect system perturb normal behavior suggest presenc intention unintention induc attack fault defect recent develop anomali outlier detect scheme propos detect attack natur unknown benefit anomali detect framework procedur extract addit featur implement addit evalu anomali detect algorithm perform standard metric specif metric suitabl detect intrus involv multipl network connect detail comparison anomali detect algorithm appli darpa intrus detect evalu data demonstr depend attack type anomali detect scheme success detect anomali past month promin techniqu appli real network data success automat identifi intrus time report cert comput emerg respons team coordin center addit investig state art intrus detect techniqu detect find cluster size exploit spatial autocorrel effici process correl dbase similar queri spatial time seri dataset collect time seri referenc locat common spatial framework correl analysi identifi pair potenti interact element cross product spatial time seri dataset dataset comput cost correl analysi high dimens time seri number locat spatial framework larg paper spatial autocorrel base search tree structur propos process strategi correl base similar rang queri similar join provid preliminari evalu propos strategi algebra cost model experiment studi earth scienc dataset usag awar pagerank web mine explor vast degre techniqu propos varieti applic includ web search web classif web person research web mine data centric point view focu primarili develop measur applic base data collect content structur usag web till time instanc project examin dimens web mine tempor dimens web data evolv time reflect ongo trend data tempor dimens reveal kind inform inform captur attent web mine research commun larg extent paper highlight signific studi evolv natur web graph classifi approach problem level analysi singl node graph graph provid framework approach problem kind identifi interest problem level experi verifi signific analysi point futur direct area approach gener appli domain data model graph network intrus detect social network find topic collect document share nearest neighbor approach import task text mine find domin topic document collect document tradit cluster techniqu hierarch cluster mean task paper explor cluster algorithm base share nearest neighbor approach unlik tradit cluster algorithm data cluster algorithm discov group document repres strong topic discard document part strong topic evalu perform algorithm real synthet data set show group document found techniqu repres coher topic produc mean addition provid theoret explan behavior predict perform random parallel search applic robot motion plan proceed siam intern confer data mine applic high perform comput model simul effort air forc research lab afrl sensor director sn inform director increasingli complex order develop test analyz surveil asset complex simul matlab tool develop provid understand environ increas amount primari secondari data emul real world increas demand system simul environ option overcom comput resourc need solv problem leverag high perform comput hpc afrl approach focu matlab mpi star applic leverag matlab user familiar interfac expand comput limit user desktop creat environ run hpc world parallel comput messag pass interfac mpi de facto standard implement program multipl processor mpi defin fortran languag function point point commun parallel program matlabmpi set matlab script implement subset mpi matlab program run parallel comput star matlab interfac combin parallel approach environ embarrassingli parallel messag pass backend support compil star leverag establish parallel numer librari perform numer comput star integr wide rang linear algebra routin seamlessli matlab user end result user familiar interfac matlab abil hpc resourc cpu memori select interesting measur associ pattern techniqu associ rule mine featur select requir suitabl metric captur depend variabl data set metric support confid lift correl collect strength determin interestinghess associ pattern measur provid conflict inform interestinghess pattern metric applic domain rare paper present overview measur propos statist machin learn data mine literatur describ kei properti examin order select measur applic domain compar studi properti made twenti exist measur show measur properti make applic domain present scenario exist measur agre support base prune tabl standard final present algorithm select small set tabl expert select desir measur small set tabl predict rare class compar dphase rule induct cost dsensit boost high perform data mine abstract recent time explos growth avail kind data result unpreced opportun develop autom data driven techniqu extract knowledg data mine import step process knowledg discoveri consist method discov interest trivial pattern hidden data sad chy field data mine build idea divers field machin learn pattern recognit statist databas system data visual techniqu develop tradit disciplin unsuit due uniqu characterist todai data set enorm size high dimension heterogen necess develop effect parallel algorithm data mine techniqu design algorithm challeng main focu paper descript parallel formul import data mine algorithm discoveri associ rule induct decis tree classif briefli discuss applic data mine analysi larg data set collect earth observ satellit process understand global scale biospher process pattern expert agreement content base rerank meta search environ mearf emerg scientif applic data mine store data mine hypothes confirm data supplement experi long term signific data molecular biologi combin clinic medic data achiev higher resolut understand treatment diseas major challeng data mine biomedicin organ molecular data cellular data clinic data wai allow integr sake knowledg extract major addit sourc inform publish medic literatur increasingli onlin full text form unstructur summari main data biomed hypothes telecommun data mine flourish telecommun due avail vast quantiti high qualiti data signific stream consist call record collect network switch primarili emerg scientif applic data mine parallel static dynam multi dconstraint graph partit discoveri web robot session base navig pattern web robot softwar program automat travers hyperlink structur world wide web order locat retriev inform reason import identifi visit web robot distinguish user commerc retail concern unauthor deploy robot gather busi intellig web site addit web robot tend consum consider network bandwidth expens user session due web robot make difficult perform clickstream analysi effect web data convent techniqu detect web robot base identifi ip address user agent web client techniqu applic robot suffici detect camouag previous unknown robot paper propos altern approach navig pattern click stream data determin due robot experiment result comput scienc depart web server log show highli accur classif model built approach show model discov camouflag previous unidentifi robot graph partit dynam adapt multi dphase scientif simul effici execut scientif simul hpc system requir partit underli mesh processor load balanc inter processor commun minim graph partit algorithm appli success purpos parallel multi phase multi physic comput pose challeng requir fundament advanc graph partit technolog addit exist graph partit algorithm suit newer heterogen highperform comput platform talk describ research effort group focus develop multi constraint multi object graph partit algorithm support advanc state ofth art numer simul technolog addit present preliminari work partit algorithm suit heterogen architectur evalu boost algorithm classifi rare class comparison improv classif rare event import data mine applic boost promis metatechniqu improv classif perform weak classifi systemat studi conduct evalu boost perform task mine rare class paper evalu exist categori boost algorithm singl viewpoint updat weight iter discuss effect recal precis rare class propos enhanc algorithm categori justifi choic weight updat paramet theoret special design synthet dataset compar capabl algorithm rare class perspect result support qualit analysi enhanc bring extra capabl achiev balanc recal precis mine rare class architectur independ analysi parallel program text categor weight adjust dnearest neighbor classif categor document challeng number discrimin word larg present nearest neighbor classif scheme text categor import discrimin word learn mutual inform weight adjust techniqu nearest neighbor document comput base match word weight evalu scheme synthet real world document experi synthet data set show scheme robust emul condit empir result real world document demonstr scheme outperform state art classif algorithm ripper rainbow pebl mine needl haystack classifi rare class dphase rule induct learn model classifi rare occur target class import problem applic network intrus detect fraud detect deviat detect gener paper analyz previous propos phase rule induct method context learn complet precis signatur rare class kei featur method separ conquer object achiev high recal high precis target class phase method aim high recal induc rule high support reason level accuraci phase improv precis learn rule remov fals posit collect record cover phase rule exist sequenti cover techniqu achiev high precis individu disjunct learn paper claim approach inadequ rare class problem splinter fals posit error prone small disjunct motiv strength phase design design synthet data model identifi analyz situat state art method ripper rule fail learn model learn poor model situat phase approach learn model significantli recal precis level present comparison method challeng real life network intrus detect dataset method significantli compar competitor term achiev balanc recal precis mine indirect associ web data wavefront diffus lmsr algorithm dynam repartit adapt mesh exist state art scheme dynam repartit adapt mesh classifi diffus base scheme scratch remap scheme present scratch remap scheme call local match multilevel scratch remap simpli lmsr lmsr scheme comput partit high overlap exist partit show lmsr decreas amount vertex migrat requir balanc graph compar current scratch remap scheme slightli imbalanc graph describ diffus base scheme refer wavefront diffus wavefront diffus flow vertic move wavefront overweight underweight domain show wavefront diffus obtain significantli lower vertex migrat requir maintain similar edg cut result compar exist diffus algorithm highli imbalanc graph compar wavefront diffusi guest editor introduct special issu high dperform data mine memori manag techniqu gang schedul parallel multilevel algorithm multi dconstraint graph partit distinguish paper load balanc dhomogen multi dresourc server emerg model comput grid interconnect similar multi resourc server distribut site job submit grid execut server resourc size balanc server approach resourc manag grid layer global load distribut system top local job manag system site classic load distribut polici fail aspect appli multi resourc server grid simpl load indic recogn resourc imbal exist server classic job select polici activ correct resourc imbalanc state show simul polici base resourc balanc perform consist classic load distribut strategi graph partit dynam adapt multi dphase comput distribut parallel knowledg discoveri workshop session titl indirect associ mine higher order depend data paper introduc pattern call indirect associ examin util applic domain exist algorithm mine associ apriori discov itemset support user defin threshold itemset support minimum support requir filter unifi algorithm load dbalanc adapt scientif simul scalabl parallel data mine associ rule import problem data mine discov associ rule databas transact transact consist set item time consum oper discoveri process comput frequenc occurr interest subset item call candid databas transact prune exponenti larg space candid exist algorithm candid user defin minimum support prune task find associ rule requir lot comput power time parallel comput offer potenti solut comput requir task provid effici scalabl parallel algorithm design paper present parallel algorithm mine associ rule intellig data distribut algorithm effici aggreg memori parallel comput emploi intellig candi report workshop distribut parallel knowledg discoveri multilevel dwai hypergraph partit paper present multilevel hypergraph partit algorithm substanti outperform exist state art pm lr algorithm multi partit optim local global object experi ispd benchmark suit show partit produc scheme averag produc pm lr algorithm term hyperedg cut metric algorithm significantli faster requir time time requir pm lr introduct hypergraph partit import problem extens applic area includ vlsi design effici storag larg databas disk data mine problem partit vertic hypergraph roughli equal part object function defin hyperedg optim commonli obj high perform data mine abstract recent time explos growth avail kind data result unpreced opportun develop autom data driven techniqu extract knowledg data mine import step process knowledg discoveri consist method discov interest trivial pattern hidden data sad chy field data mine build idea divers field machin learn pattern recognit statist databas system data visual techniqu develop tradit disciplin unsuit due uniqu characterist todai data set enorm size high dimension heterogen necess develop effect parallel algorithm data mine techniqu design algorithm challeng main focu paper descript parallel formul import data mine algorithm discoveri associ rule induct decis tree classif briefli discuss applic data mine analysi larg data set collect earth observ satellit process understand global scale biospher process pattern effici parallel algorithm mine associ dynam repartit adapt refin mesh pspase effici scalabl parallel spars direct solver problem engin scientif domain requir solv larg spars system linear equat computation intensivesteptoward final solut long beenachalleng develop effici parallel formul spars direct solver due complex step involv process paper describ pspase effici portabl robust scalabl parallel solver spars symmetr posit definit linear system wehavedevelop discuss algorithm implement issu involv develop present perform scalabl result crayt sgi origin pspase solv largest spars system million equat solv direct method highest perform gflop choleski factor report document categor queri gener world wide web webac present webac agent explor categor document world wide web base user profil heart agent unsupervis categor set document combin process gener queri search relat document filter result document extract close relat start set document categori priori present architectur describ algorithm provid signific improv tradit cluster algorithm form basi queri gener search compon agent report result experi compar algorithm tradit cluster algorithm show algorithm fast scalabl parallel formul decis dtree classif algorithm classif decis tree algorithm extens data mine domain retail target market fraud detect highli parallel algorithm construct classif decis tree desir deal larg data set reason amount time algorithm build classif decis tree natur concurr difficult parallel due inher dynam natur comput paper present parallel formul classif decis tree learn algorithm base induct describ basic parallel formul base synchron tree construct approach base partit tree construct approach discuss advantag disadvantag method propos hybrid method emploi good featur method provid analysi cost comput commun propos hybr chameleon hierarch cluster dynam model advanc algorithm difficulti deal highli variabl cluster follow preconceiv model base select interconnect close chameleon algorithm yield accur result highli variabl cluster wssmp high dperform serial parallel symmetr spars linear solver state art parallel search techniqu discret optim problem multilevel hypergraph partit applic vlsi domain paper present hypergraphpartit algorithm base multilevel paradigm multilevel paradigm sequenc success coarser hypergraph construct bisect smallest hypergraph comput obtain bisect origin hypergraph success project refin bisect level finer hypergraph develop hypergraph coarsen strategi multilevel framework evalu perform term size hyperedg cut bisect run time number larg scale integr circuit experi show multilevel hypergraph partit algorithm produc high qualiti partit small amount time qualiti partit produc scheme averag produc state art scheme partit algorithm significantli faster requir time time requir scheme multilevel hypergraph partit algorithm scale larg hypergraph hypergraph vertic bisect minut todai workstat larg hypergraph scheme outperform scheme hyperedg cut consist larger margin webac web agent document categor explor propos agent explor categor document world wide web heart agent automat categor set document combin process gener queri search relat document filter result document extract set document close relat start set document categori priori present architectur describ algorithm provid signific improv tradit cluster algorithm form basi queri gener search compon agent introduct world wide web vast resourc inform servic continu grow rapidli power search engin develop aid locat unfamiliar document categori content subject reli larg index document locat web search engin determin url document satisfi parallel formul decis dtree classif algorithm classif decis tree algorithm extens data mine domain retail target market fraud detect highli parallel algorithm construct classif decis tree desir deal larg data set reason amount time algorithm build classif decis tree natur concurr difficult parallel due inher dynam natur comput paper present parallel formul classif decis tree learn algorithm base induct describ basic parallel formul base synchron tree construct approach base partit tree construct approach discuss advantag disadvantag method propos hybrid method emploi good featur method provid analysi cost comput commun propos hybr scalparc scalabl effici parallel classif algorithm mine larg dataset paper present scalparc scalabl parallel classifi parallel formul decis tree base classif process state art decis tree classifi sprint scalparc suit handl larg dataset show exist parallel formul sprint unscal scalparc shown scalabl runtim memori requir present experiment result classifi million record processor crai order demonstr scalabl behavior scalparc kei compon scalparc parallel hash tabl propos parallel hash paradigm parallel algorithm requir concurr updat larg hash tabl introduct classif import problem rapidli emerg field data mine problem state train dataset consist record record identif wssmp high dperform serial parallel symmetr spars linear solver load balanc dynam adapt mesh dbase comput hypergraph base cluster high ddimension data set summari result cluster data larg dimens space great interest data mine applic paper propos method cluster data high dimension space base hypergraph model method relationship present origin data high dimension space map hypergraph hyperedg repres relationship affin subset data weight hyperedg reflect strength affin hypergraph partit algorithm find partit vertic data item partit highli relat weight hyperedg cut partit minim present result experi data set amp stock data period protein code data experi demonstr approach applic effect high dimension dataset introduct cluster data mine disco declust load dbalanc method parallel geograph inform system declust load balanc import issu design high perform geograph inform system hpgi central compon interact applic real time terrain visual current literatur effici method declust spatial point data work develop effici declust method collect extend object chain line segment polygon paper focu data partit approach parallel gi oper provid framework declust collect extend spatial object identifi kei issu work load metric ii spatial extent work load iii distribut work load spatial extent iv declust method identifi experiment evalu altern issu addit provid framework dynamical parallel algorithm multilevel graph partit spars matrix order multilevel dwai partit scheme irregular graph scalabl parallel formul barn dhut method dbodi simul paper present parallel formul barn hut method parallel formul suit simul irregular particl densiti present parallel formul static partit domain assign subdomain processor demonstr scheme deliv accept load balanc coupl collect commun oper yield good perform present parallel formul combin static decomposit domain assign subdomain processor base morton order allevi load imbal inher scheme parallel formul inspir parallel algorithm barn hut method present experiment evalu scheme processor ncube parallel comput astrophys simul multilevel hypergraph partit applic vlsi domain paper present hypergraphpartit algorithm base multilevel paradigm multilevel paradigm sequenc success coarser hypergraph construct bisect smallest hypergraph comput obtain bisect origin hypergraph success project refin bisect level finer hypergraph develop hypergraph coarsen strategi multilevel framework evalu perform term size hyperedg cut bisect run time number larg scale integr circuit experi show multilevel hypergraph partit algorithm produc high qualiti partit small amount time qualiti partit produc scheme averag produc state art scheme partit algorithm significantli faster requir time time requir scheme multilevel hypergraph partit algorithm scale larg hypergraph hypergraph vertic bisect minut todai workstat larg hypergraph scheme outperform scheme hyperedg cut consist larger margin cluster base associ rule hypergraph cluster data mine discoveri process group set data intraclust similar maxim interclust similar minim discov cluster explain characterist data distribut paper propos methodolog cluster relat item associ rule cluster relat transact cluster item approach linearli scalabl respect number transact frequent item set deriv associ rule group item hypergraph edg hypergraph partit algorithm find cluster experi cluster associ rule hypergraph hold great promis applic domain experi stock market data congression vote data show cluster scheme successfulli group item belong group cluster item repartit adapt mesh experi multilevel diffus coars dgrain parallel formul multilevel dwai graph partit algorithm paper present parallel formul multilevel graph partit algorithm suit messag pass librari high latenc multilevel partit algorithm reduc size graph success collaps vertic edg coarsen phase find partit smaller graph construct partit origin graph project refin partit success finer graph uncoarsen phase algorithm achiev high degre concurr maintain high qualiti partit produc serial algorithm design implement scalabl parallel direct solver spars symmetr posit definit system preliminari result solv larg spars system linear equat core problem engin scientif comput long challeng develop parallel formul spars direct solver due complex step involv process paper describ effici practic robust parallel solver spars symmetr posit definit linear system develop discuss algorithm implement issu involv develop introduct solv larg spars system linear equat heart engin scientif comput applic method solv system direct iter direct method prefer applic properti method natur applic wide class spars linear system aris practic symmetr posit definit spd coeffici matrix problem role messag dpass perform orient parallel program scalabl parallel data mine associ rule import problem data mine discov associ rule databas transact transact consist set item time consum oper discoveri process comput frequenc occurr interest subset item call candid databas transact prune exponenti larg space candid exist algorithm candid user defin minimum support prune task find associ rule requir lot comput power time parallel comput offer potenti solut comput requir task provid effici scalabl parallel algorithm design paper present parallel algorithm mine associ rule intellig data distribut algorithm effici aggreg memori parallel comput emploi intellig candi highli scalabl parallel algorithm spars matrix factor paper describ scalabl parallel algorithm spars matrix factor analyz perform scalabl present experiment result processor crai parallel comput analysi experiment result demonstr algorithm substanti improv state art parallel direct solut spars linear system term scalabl perform fact dens matrix factor scale implement effici parallel comput paper present algorithm factor wide class spars matric includ aris dimension finit element problem asymptot scalabl dens matrix factor algorithm varieti parallel architectur algorithm incur commun overhead scalabl previous parallel formul spars matrix factor paper discuss choleski factor symmetr posit definit matric algorithm adapt solv spars linear squar problem gaussian elimin diagon domin matric symmetr structur implement spars choleski factor algorithm deliv gflop crai medium size structur engin linear program problem knowledg multilevel diffus scheme repartit adapt mesh larg class irregular mesh applic structur mesh phase comput eventu mesh evolv adapt mesh repartit ensur good load balanc graph partit scratch lead excess migrat data processor paper present scheme comput repartit adapt refin mesh perform diffus parallel formul inform random search robot motion plan problem show path articul robot degre freedom gener second nonsystemat parallel search present experiment result obtain multicomput accur model joint manipul arm oper realist workspac present discuss fast method smooth path deliv parallel algorithm introduct skill robot requir abil plan path execut task intent paper provid experiment evid fast path plan perform parallel algorithm fast system produc solut fraction second second complex environ robot degre freedom dof develop parallel formul random path planner propos barraquand latomb parallel formul prove extrem eff parallel multilevel graph partit parallel gi share address space architectur multilevel graph partit scheme abstract paper present experi class graph partit algorithm reduc size graph collaps vertic edg partit smaller graph uncoarsen construct partit origin graph investig effect choic phase coarsen partit coarsest graph refin present coarsen heurist call heavi edg heurist size partit coars graph small factor size final partit obtain multilevel refin present scheme refin uncoarsen faster kernighan lin refin test scheme larg number graph aris domain includ finit element method linear program vlsi transport experi show scheme consist produc partit produc spectral partit scheme substanti smaller timer time faster multilevel spectral bisect scheme comput fill reduc order spars matric substanti outperform wide multipl minimum degre algorithm parallel formul inform random search robot motion plan problem show path articul robot degre freedom gener second nonsystemat parallel search present experiment result obtain multicomput accur model joint manipul arm oper realist workspac present discuss fast method smooth path deliv parallel algorithm introduct skill robot requir abil plan path execut task intent paper provid experiment evid fast path plan perform parallel algorithm fast system produc solut fraction second second complex environ robot degre freedom dof develop parallel formul random path planner propos barraquand latomb parallel formul prove extrem eff highli parallel interior point algorithm dbodi simul messag passs parallel comput optim scalabl parallel spars choleski factor posit paper posit paper describ experi repositori base framework evolutionari softwar develop design develop argo support administr argo semi govern organ manag hundr public school framework develop applic share common busi model requir databas electron document workflow internet function framework meta repositori captur formal inform knowledg busi model part knowledg explicitli model practic formal model configur manag repositori provid user high level tool requir busi model system run end user tool user select applic enter view data queri repositori displai print export result queri access thesauru manag electron document workflow analysi multilevel graph partit recent number research investig class algorithm base multilevel graph partit moder comput complex provid excel graph partit exist theoret analysi explain abil multilevel algorithm produc good partit paper present analysi show reason assumpt refin uncoarsen phase good bisect coarser graph wors good bisect finer graph small factor show size good vertex separ coars graph project finer graph perform refin uncoarsen phase higher size good vertexsepar finer graph small factor parallel algorithm forward back substitut direct solut spars linear system parallel algorithm solv triangular system result parallel factor spars linear system propos implement recent present detail analysi parallel complex scalabl algorithm result implement processor crai parallel comput common belief parallel spars triangular solver unscal due high commun comput ratio analysi experi show scalabl parallel spars choleski factor algorithm parallel spars triangular solver yield reason speedup runtim hundr processor show wide class problem spars triangular solver paper optim asymptot scalabl dens triangular solver parallel matrix dvector product approxim hierarch method matrix vector product mat vec form core iter method solv dens linear system system aris solut integr equat electromagnet heat transfer wave propag paper present parallel approxim method comput mat vec solut integr equat method comput dens mat vec hundr thousand element combin speedup obtain approxim method parallel process repres improv order magnitud exact mat vec uniprocessor demonstr parallel formul incur minim parallel process overhead scale larg number processor studi impact vari accuraci approxim mat vec time parallel effici work support ist bmdo armi research offic contract da daah nsf grant nsg ri load balanc high perform gi declust polygon map perform scalabl precondit conjug gradient method parallel comput parallel search algorithm discret optim problem introduct parallel comput parallel pars algorithm natur languag tree adjoin grammar dee adjoin grammar tag power grammat formal larg scale natur lan guag process comput plexiti pars algorithm tag high introduc parallel tag pars algorithm mimd hypercub multicomput larg granular grammar partit asynchron munic distribut termin detect describ implement ncube parallel comput provid experiment resuli random english grammar algo rithm deliv perform tag par ing algorithm date yield order magnitud speedup good efici processor tag pars highli unstructur problem base experi develop parallel tag parser draw gener conclus solv unstructur problem parallel formul interior point algorithm scalabl parallel formul barn dhut method dbodi simul paper present parallel formul barn hut method parallel formul suit simul irregular particl densiti present parallel formul static partit domain assign subdomain processor demonstr scheme deliv accept load balanc coupl collect commun oper yield good perform present parallel formul combin static decomposit domain assign subdomain processor base morton order allevi load imbal inher scheme parallel formul inspir parallel algorithm barn hut method present experiment evalu scheme processor ncube parallel comput astrophys simul scalabl parallel algorithm spars choleski factor paper describ scalabl parallel algorithm spars choleski factor analyz perform scalabl present experiment result implement processor ncube parallel comput analysi experiment result demonstr algorithm improv state art parallel direct solut spars linear system order magnitud term speedup number processor util effect problem size algorithm incur strictli commun overhead scalabl parallel formul spars matrix factor show algorithm optim scalabl hypercub mesh architectur asymptot scalabl dens matrix factor wide class spars linear system includ aris dimension finit element problem introduct unstructur tree search simd parallel comput paper present method load balanc unstructur tree comput larg scale simd machin analyz scalabl exist scheme effici formul tree search simd machin compris major compon trigger mechan determin search space redistribut occur balanc search space processor ii scheme redistribut search space devis redistribut mechan trigger mechan conjunct trigger redistribut mechan develop research analyz scalabl mechan verifi result experiment analysi experi show load balanc method highli scalabl simd architectur scalabl shown wors load balanc scheme mimd architectur verifi theoret scalabl parallel formul backpropag algorithm hypercub relat architectur abstract paper present techniqu map backpropag algorithm hypercub relat architectur kei compon techniqu network partit scheme call checkerboard checkerboard replac broadcast oper perform commonli vertic network partit scheme oper faster hypercub relat architectur checkerboard combin pattern partit techniqu form hybrid scheme perform scheme theoret analysi experiment result ncube tm cm tm show scheme perform scheme uniform uniform network scalabl load balanc techniqu parallel comput paper analyz scalabl number load balanc algorithm appli problem characterist work processor partit independ work piec work piec highli variabl size difficult estim size total work processor problem requir load balanc scheme distribut work dynam processor goal determin scalabl load balanc scheme architectur hypercub mesh network workstat architectur establish lower bound scalabl load balanc scheme present scalabl analysi number load balanc scheme analyz valuabl insight rel perform problem architectur characteristi scalabl parallel algorithm matrix multipl number parallel formul dens matrix multipl algorithm develop arbitrarili larg number processor algorithm variant provid linear speedup suffici larg matrix size algorithm claim superior paper analyz perform scalabl number parallel formul matrix multipl algorithm predict condit formul present parallel formul hypercub relat architectur perform scheme literatur wide rang matrix size number processor superior perform analyt scalabl express algorithm verifi experi think machin corpor cm tm parallel comput processor show special har parallel search algorithm robot motion plan show path dexter robot gener second parallel inform random search multicomput experiment result present obtain varieti robot joint oper realist workspac effici parallel map dynam program algorithm summari result perform scalabl precondit conjug gradient method cm effici parallel backtrack isol execut parallel backtrack search exhibit speedup anomali paper present analyt model experiment result averag case behavior parallel backtrack type backtrack search algorithm simpl backtrack heurist inform ii heurist backtrack heurist order prune search present analyt model compar averag number node visit sequenti parallel search case simpl backtrack show averag speedup obtain linear distribut solut uniform ii superlinear distribut solut uniform heurist backtrack averag speedup obtain linear linear superlinear speedup obtain subset instanc call difficult instanc superlinear present experiment result scalabl fft parallel comput algorithm constraint dsatisfact problem survei larg varieti problem artifici intellig area comput scienc view special case constraint satisfact problem exampl machin vision belief mainten schedul tempor reason graph problem floor plan design plan genet experi satisfi problem number approach develop solv problem constraint propag simplifi origin problem backtrack directli search solut combin techniqu paper present overview approach tutori fashion perform properti larg scale parallel system metric character perform parallel system parallel execut time speedup effici number properti metric studi fact parallel architectur problem fix size speedup parallel algorithm continu increas increas number processor satur peak limit emploi optim number processor solv problem parallel comput optim number processor depend problem size parallel algorithm parallel architectur paper studi impact parallel process overhead degre concurr parallel algorithm optim number processor criterion optim minim parallel execut time studi gener criterion optimalit unstructur tree search simd parallel comput summari result scalabl analysi partit strategi finit element graph summari result algorithm constraint dsatisfact problem survei larg varieti problem artifici intellig area comput scienc view special case constraint satisfact problem exampl machin vision belief mainten schedul tempor reason graph problem floor plan design plan genet experi satisfi problem number approach develop solv problem constraint propag simplifi origin problem backtrack directli search solut combin techniqu paper present overview approach tutori fashion depth dfirst versu dfirst search analysi scalabl parallel algorithm architectur survei scalabl parallel sort mesh multicomput paper present parallel algorithm qsp qsp base sequenti quicksort sort data mesh multicomput analyz scalabl isoeffici metric show qsp match lower bound isoeffici function mesh multicomput isoeffici qsp fairli close optim lang al schnorr al develop parallel sort algorithm mesh architectur optim schnorr close optim lang run time complex element processor case qsp qsp wors perform algorithm element perprocessor case qsp qsp scalabl scale variant algorithm case element processor result parallel formul scale variant term speedup sequenti algorithm present dif gener heurist bottom dup procedur search graph dparallel execut logic program share dmemori multiprocessor scalabl parallel algorithm dpair shortest dpath problem abstract paper isoeffici metric analyz scalabl parallel algorithm find shortest path pair node dens connect graph parallel algorithm analyz paper previous present small variat scalabl analyz respect mesh hypercub share memori architectur demonstr isoeffici function compact predictor perform fact previou compar predict algorithm base experiment result shown incorrect isoeffici function predict correctli find classic tradeoff hardwar cost time memori time repres tradeoff hardwar cost scalabl memori scalabl scalabl parallel algorithm dpair shortest path problem summari result automat test pattern gener multiprocessor summari result parallel dfirst search state dspace graph summari result paper present parallel formul branch bound search algorithm parallel formul primarili differ data structur formul suit share memori architectur suit distributedmemori architectur parallel formul implement solv vertex cover problem tsp problem bbn butterfli parallel processor data structur obtain fairli linear speedup processor discov problem characterist make formul suitabl search problem bestfirst search paradigm branch bound commonli expect parallel formul effect varieti problem concurr distribut prioriti queue parallel formul parallel algorithm parallel bra perform dparal execut logic program share dmemori multiprocessor superlinear speedup parallel state dspace search dparallel execut logic program share memori multiprocessor summari result concurr access prioriti queue heap import data structur prioriti queue wide varieti parallel algorithm multiprocessor schedul branch bound algorithm content share heap limit obtain speedup paper present approach concurr insert delet heap share memori multiprocessor scheme retain strict prioriti order serial access heap algorithm delet oper return kei kei insert insert time delet start experiment result bbn butterfli parallel processor demonstr concurr heap algorithm parallel branch bound improv perform substanti index term concurr data structur prioriti queue insert delet branchand bound speedup introduct heap import data structur prioriti queue wide varieti paral data ddepend dbase intellig backtrack scheme prolog parallel implement iter ddeepen da paper present parallel implement iter deepen algorithm parallel distribut memorymachin kind dynam load balanc strategi studi overcom irregular tree search problem studi effect algorithm test solv np complet problem fifteen puzzl experiment result cluster alpha processor pvm show effici speedup achiev hard problem intellig backtrack scheme prolog framework intellig backtrack logic program intellig backtrack algorithm parallel execut logic program parallel execut scheme exploit parallel logic program gener bottom dup procedur search graph integr knowledg problem solv search procedur gener branch bound relat ao composit decis process unifi formul heurist search gener branch bound formul understand synthes tree search procedur gener paradigm search procedur branch bound formul sequenti parallel game tree search preliminari result practic signific distribut partit sort 